Enhanced belief propagation decoding of polar codes by adapting the parity-check matrix
نویسندگان
چکیده
منابع مشابه
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix
An iterative soft input soft output (SISO) decoding algorithm for Reed-Solomon (RS) codes using their binary image representations is presented. The novelty of the iterative algorithm is in reducing a submatrix corresponding to the less reliable bits in the binary parity check matrix of the RS code to a sparse nature before each decoding iteration. The proposed algorithm can geometrically be in...
متن کاملReduced complexity iterative decoding of low-density parity check codes based on belief propagation
In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two al...
متن کاملIterative Decoding beyond Belief Propagation of Low-density Parity-check Codes
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
متن کاملSparse Graphs for Belief Propagation Decoding of Polar Codes
We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for conventional belief propagation (BP) decoding. We discuss several pruning techniques based on the check node decoder (CND) and variable node decoder (VND) update ...
متن کاملBelief Propagation Decoding of Polar Codes on Permuted Factor Graphs
We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations. With a genie-aided stopping condition, it can achieve the successive cancellation list (SCL) decoding performance which has already been shown to achieve the maximum likelihood (ML) bound provided that the list size is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2017
ISSN: 1687-1499
DOI: 10.1186/s13638-017-0825-3